90. Subsets II.go

package leetcode

import (
"fmt"
"sort"
)

funcsubsetsWithDup(nums []int) [][]int {
c, res:= []int{}, [][]int{}
sort.Ints(nums) // 这里是去重的关键逻辑
fork:=0; k<=len(nums); k++ {
generateSubsetsWithDup(nums, k, 0, c, &res)
 }
returnres
}

funcgenerateSubsetsWithDup(nums []int, k, startint, c []int, res*[][]int) {
iflen(c) ==k {
b:=make([]int, len(c))
copy(b, c)
*res=append(*res, b)
return
 }
// i will at most be n - (k - c.size()) + 1
fori:=start; i<len(nums)-(k-len(c))+1; i++ {
fmt.Printf("i = %v start = %v c = %v\n", i, start, c)
ifi>start&&nums[i] ==nums[i-1] { // 这里是去重的关键逻辑,本次不取重复数字，下次循环可能会取重复数字
continue
 }
c=append(c, nums[i])
generateSubsetsWithDup(nums, k, i+1, c, res)
c=c[:len(c)-1]
 }
return
}